LAST VISIT TIME TESTS FOR PSEUDORANDOM NUMBERS
نویسندگان
چکیده
منابع مشابه
Using Quasigroups for Generating Pseudorandom Numbers
This paper presents an algorithm for generating pseudorandom numbers using quasigroups. Random numbers have several applications in the area of secure communication. The proposed algorithm uses a matrix of size n x n which is pre-generated and stored. The quality of random numbers generated is compared with other pseudorandom number generator using Marsaglia’s Diehard battery of tests.
متن کاملPseudorandom numbers and entropy conditions
Computer generated pseudorandom numbers are used in many algorithms of applied mathematics (Monte Carlo methods, simulation, etc.) and the performance of such algorithms depends in an essential way on the properties of the random numbers used. A simple but important concept in the study of pseudorandomness is the discrepancy, characterizing how close the distribution of a finite sequence is to ...
متن کاملNormal Numbers and Pseudorandom Generators∗
For an integer b ≥ 2 a real number α is b-normal if, for all m > 0, every m-long string of digits in the base-b expansion of α appears, in the limit, with frequency b−m. Although almost all reals in [0, 1] are b-normal for every b, it has been rather difficult to exhibit explicit examples. No results whatsoever are known, one way or the other, for the class of “natural” mathematical constants, ...
متن کاملGambling Tests for Pseudorandom Number Generators
This paper extends the idea of serial tests by employing a carefully selected dimension reduction which is equivalent to playing a gambling strategy in a fair coin ipping game. We apply the generalized-divergence for testing the hypothesis that the simulated coin is fair and memoryless. An application to Twisted GFSR generators shows the ability of our test to detect deviations from equidistrib...
متن کاملOn Generalized Inversive Congruential Pseudorandom Numbers
The inversive congruential method with prime modulus for generating uniform pseudorandom numbers has several very promising properties. Very recently, a generalization for composite moduli has been introduced. In the present paper it is shown that the generated sequences have very attractive statistical independence properties.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japanese Society of Computational Statistics
سال: 1996
ISSN: 0915-2350,1881-1337
DOI: 10.5183/jjscs1988.9.1